Optimal control

Results: 1068



#Item
281Dynamic programming / Optimal control / Mathematical sciences / Markov decision process / Relaxation / Mathematical optimization / Statistics / Operations research

Asymptotically optimal index policies for an abandonment queue with convex holding cost∗ M. Larra˜ naga1,2,5 , U. Ayesta2,3,4,5 , I.M. Verloop1,5 1 CNRS, IRIT, 2 rue C. Carmichel, FToulouse, France.

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2015-04-15 10:57:22
282Stochastic control / Latin alphabets / Control theory / Optimal control

PDF Document

Add to Reading List

Source URL: ffj.ehess.fr

Language: English - Date: 2015-01-28 10:07:43
283Differential calculus / Functions and mappings / Control theory / Differential equation / Derivative / Differential of a function / Group action / State space / Function / Mathematics / Mathematical analysis / Calculus

Design of Optimal Robot User Interfaces Kris Hauser School of Informatics and Computing, Indiana University at Bloomington {hauserk}@indiana.edu I. I NTRODUCTION

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:31
284Search algorithms / Combinatorial optimization / Routing algorithms / Rapidly-exploring random tree / Robot control / Shortest path problem / A* search algorithm / Graph / Connectivity / Mathematics / Graph theory / Theoretical computer science

Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs arXiv:1405.5848v6 [cs.RO] 26 FebJonathan D. Gammell1 , Siddhartha S. Srinivasa2

Add to Reading List

Source URL: www.ri.cmu.edu

Language: English - Date: 2015-05-20 10:11:27
285Systems theory / Dynamic programming / Equations / Markov processes / Decision theory / Loss function / Bellman equation / Asymptotically optimal algorithm / Markov decision process / Statistics / Control theory / Mathematical optimization

This paper was presented as part of the main technical program at IEEE INFOCOMA Nearly-Optimal Index Rule for Scheduling of Users with Abandonment Urtzi Ayesta∗† , Peter Jacko∗ and Vladimir Novak∗‡ ∗ B

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2012-01-01 05:04:19
286Network theory / Robot control / Probabilistic roadmap / Motion planning / Shortest path problem / Graph / Geometric spanner / Widest path problem / Mathematics / Theoretical computer science / Graph theory

Asymptotically Near-Optimal Planning with Probabilistic Roadmap Spanners James D. Marble and Kostas E. Bekris I. I NTRODUCTION Roadmap planners [1] utilize an off-line phase to build

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:50
287Heuristics / Artificial intelligence / Rapidly-exploring random tree / Robot control / Combinatorial optimization / Routing algorithms / Heuristic function / A* search algorithm / Motion planning / Search algorithms / Mathematics / Applied mathematics

Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic Jonathan D. Gammell1 , Siddhartha S. Srinivasa2 , and Timothy D. Barfoot1 Abstract— Rapidly-explori

Add to Reading List

Source URL: www.ri.cmu.edu

Language: English - Date: 2014-07-22 11:25:05
288Heat equation / Heat transfer / Mathematics / Ordinary differential equations / Optimal control / Partial differential equations

doi:j.na

Add to Reading List

Source URL: www-m6.ma.tum.de

Language: English - Date: 2006-04-03 17:03:56
289Mathematical optimization / Optimal control

Mathematics-in-Industry Case Studies Journal, Volume 2, pp) Optimizing the profit from a complex cascade of hydroelectric stations with recirculating water. Andrei Korobeinikov ∗ Marta Pascoal

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2015-03-23 09:45:56
290Robot control / Search algorithms / Rapidly-exploring random tree / Motion planning / Algorithm / Asymptotic computational complexity / Asymptotically optimal algorithm / Probabilistic roadmap / Shortest path problem / Applied mathematics / Mathematics / Theoretical computer science

Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula

Add to Reading List

Source URL: iros2011.org

Language: English - Date: 2011-09-21 07:00:30
UPDATE